Spaces with acyclic point complements
نویسندگان
چکیده
منابع مشابه
Schur Complements on Hilbert Spaces and Saddle Point Systems
For any continuous bilinear form defined on a pair of Hilbert spaces satisfying the compatibility Ladyshenskaya-Babušca-Brezzi condition, symmetric Schur complement operators can be defined on each of the two Hilbert spaces. In this paper, we find bounds for the spectrum of the Schur operators only in terms of the compatibility and continuity constants. In the light of the new spectral results ...
متن کاملSchur complements of matrices with acyclic bipartite graphs
Bipartite graphs are used to describe the generalized Schur complements of real matrices having no square submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be determined uniquely by the sign pattern of A. Moreover, if A has a normalized LU factorization A = L...
متن کاملMatching Subspaces with Complements in Finite Vector Spaces
Let C (n; q) denote the graph whose vertices are the subspaces of the n dimensional vector space V over GF (q) and whose edges are the pairs fX; Y g where X Y = V. We show that C (n; q) has a perfect matching if and only if q is odd or n is odd. If q and n are even and q > 2 we show there exist matchings which omit only one vertex.
متن کاملEfficient PAC Learning for Episodic Tasks with Acyclic State Spaces
This paper considers the problem of computing an optimal policy for a Markov Decision Process (MDP), under lack of complete a priori knowledge of (i) the branching probability distributions determining the evolution of the process state upon the execution of the different actions, and (ii) the probability distributions characterizing the immediate rewards returned by the environment as a result...
متن کاملColored Point-Set Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require Ω(n 2 3 ) edges each having Ω(n 1 3 ) bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1966
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1966-0198458-9